Shitalkumar A. ¹, Vijay T. Raisinghani ¹

Affiliations
1 School of Engineering, MPSTME, NMIMS University, Mumbai – 400056, IN

Abstract

Background/Objectives: Load eqUilibrium Neighbor Aware Routing (LUNAR)1 is proposed to address broadcast storm problem. In this paper, we discuss algorithm, flow-chart, working example along with simulation results of LUNAR in detail. Methods/Statistical Analysis: To address the problem, existing reactive routing protocols use one of the node metrics such as size of routing table, available queue space, neighbor count, available battery life, etc. However, measurement of single parameter at an intermediate node may not be the true measure of route stability or lifetime. LUNAR combines the advantages of neighbor coverage knowledge and load balancing techniques to implement decision making system at every intermediate node. Findings: We evaluate the performance of LUNAR with respect to performance metrics like Normalized Routing Overhead, End-to-End Delay and Packet Loss Rate in different network scenarios. LUNAR minimizes the routing overhead of the network by 31-54% compared to AODV and NCPR due to the reduction in routing packets required for route discovery. LUNAR reduces end-to- end delay by 15-32% and packet loss rate by 9-35% compared to AODV and NCPR. Applications/Improvements: Simulation result shows the reduction in rebroadcasting of routing packets.

Keywords

Broadcasting Storm, End-End Delay (EED), MANET, Normalized Routing Overhead (NRO), Packet Loss Rate (PLR), Route Request Storm.

Full Text

   

Seema Anand Ladhe ¹, Vijay T. Raisinghani ¹

Affiliations
1 School of Engineering, NMIMS University, Mumbai - 400056, Maharashtra, IN

Abstract

Background/Objectives: Existing one-to-one, dedicated path-based and link-based MPLS-based recovery schemes are not resource efficient. We propose Common Protection Path, a novel protection scheme which ensures efficient utilization of resources. Methods/Statistical Analysis: Common Protection Path (CPP) selects a common protection path for traffic demands having the same ingress and egress routers. CPP factors in path failure probability and restoration priority levels of the traffic demands, unlike other schemes. We validated CPP algorithm using ns-2, over realistic network topology COST 239 with different link capacities. We compared CPP with one-to-one, dedicated path-based, link-based schemes and our modification of UNIFR (RFNS) i.e. UNIFR-similar. Findings: Our results show that using CPP scheme, more working bandwidth can be protected and more number of demands can be protected as compared to dedicated path-based, oneto- one, link-based and UNIFR-similar schemes. Our experimental results show that depending on the link capacity and the scheme taken for comparison, CPP provides up to 7.72% to 93.63% higher protection for COST 239 topology. Also with respect to restoration overbuild per Gbps protected bandwidth, CPP scheme is better as compared to other schemes. Applications/Improvements: Our results show that the CPP scheme results in efficient utilization of resources.

Keywords

Dedicated Path-Based, Link-Based, MPLS-Based Recovery, Protection Path

Full Text